Nested Circles Boundary Algorithm for Rotated Texture Classification
نویسندگان
چکیده
منابع مشابه
Dominant Rotated Local Binary Patterns (DRLBP) for texture classification
In this paper, we present a novel rotation-invariant and computationally efficient texture descriptor called Dominant Rotated Local Binary Pattern (DRLBP). A rotation invariance is achieved by computing the descriptor with respect to a reference in a local neighborhood. A reference is fast to compute maintaining the computational simplicity of the Local Binary Patterns (LBP). The proposed appro...
متن کاملHybrid Ant Colony Algorithm for Texture Classification
This paper presents a novel ant colony algorithm integrating genetic algorithms and simplex algorithms. This method is able to not only speed u p searching process for optimal solutions, bu t also improve the quality of the solutions. I n this paper, the proposed method is applied to set up a learning model for the "Tuned" mask, which is used for texture classification. Experimental results on ...
متن کاملFPGA Implementation of Generalized Hebbian Algorithm for Texture Classification
This paper presents a novel hardware architecture for principal component analysis. The architecture is based on the Generalized Hebbian Algorithm (GHA) because of its simplicity and effectiveness. The architecture is separated into three portions: the weight vector updating unit, the principal computation unit and the memory unit. In the weight vector updating unit, the computation of differen...
متن کاملA Combinatorial K-View Based algorithm for Texture Classification
Image texture classification is widely used in many applications and received considerable attention during the past decades. Several efforts have been made for developing image texture classification algorithms, including the Gray Level Co-Occurrence Matrix (GLCM), Local Binary Patterns and several K-View based algorithms. These K-View based algorithms included are K-ViewTemplate algorithm (K-...
متن کاملNested Partitions Using Texture Segmentation
A multi-step method of partitioning the pixels of an image such that the partitions at one step are wholly nested inside the partitions of the next step is described, i.e. we describe an agglomerative, hierarchical segmentation technique that uses texture information to perform the segmentation. The image is requantized using K-Means clustering. Then, clusters are expanded using region growing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2011
ISSN: 1812-5654
DOI: 10.3923/jas.2011.3351.3361